Is a complete, reduced set necessarily of constant width?
نویسندگان
چکیده
منابع مشابه
Clique-Width is NP-Complete
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order quantification on vertex sets, that includes NP-hard problems such as 3-colorability) can be solved in polynomial time for graphs of bounded clique-width. We show that the clique-width of a given graph canno...
متن کاملDAG-width is PSPACE-complete
Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining the DAG-width of a graph for any fixed k. However, if the DAG-width of the graphs from a class is not bounded, such algorithms become exponential. This raises the question whether we can always find a DAG ...
متن کاملFunctions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable
We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided -testing algorithm must make at least (n1=10) many queries for some fixed small enough . This shows that Newman’s result [15] cannot be generalized to read-k-times functions for k > 1.
متن کاملBounded-width QBF is PSPACE-complete
Tree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In this paper we focus on the canonical PSPACE-complete problem QBF, the fully-quantified version of SAT. It was shown by Pan and Vardi that this problem is PSPACE-complete even fo...
متن کاملThe Resolution Width Problem is EXPTIME-Complete
The importance of width as a resource in resolution theorem proving has been emphasized in the work of Ben-Sasson and Wigderson. Their results show that lower bounds on the size of resolution refutations can be proved in a uniform manner by demonstrating lower bounds on the width of refutations, and that there is a simple dynamic programming procedure for automated theorem proving based on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Geometry
سال: 2019
ISSN: 1615-7168,1615-715X
DOI: 10.1515/advgeom-2017-0058